Approximation algorithm for the balanced 2-connected k-partition problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn O(log k)-approximation algorithm for the k-vertex connected subgraph problem
We present an O(log n · log k)-approximation algorithm for the problem of finding k-vertex connected spanning subgraph of minimum cost, where n is the number of vertices in the input graph, and k is the connectivity requirement. Our algorithm works for both directed and undirected graphs. The best known approximation guarantees for this problems are O(ln k · min{ √ k, n n−k ln k}) by Kortsarz a...
متن کاملA 2 + ǫ approximation algorithm for the k-MST problem
For any ǫ > 0 we give a (2+ǫ)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [5]. As in [5] the algorithm extends to a (2+ǫ)-approximation algorithm for the minimum tour that visits any k vertices, provided the edge costs satisfy the triangle inequality.
متن کاملAn O(log k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem∗
We present an O(log k)-approximation algorithm for the problem of finding a k-vertex connected spanning subgraph of minimum cost, where n is the number of vertices in an input graph, and k is a connectivity requirement. Our algorithm is the first that achieves a polylogarithmic approximation ratio for all values of k and n, and it works for both directed and undirected graphs. As in previous wo...
متن کاملApproximation algorithm for the minimum weight connected k-subgraph cover problem
Article history: Received 16 December 2013 Received in revised form 5 March 2014 Accepted 24 March 2014 Communicated by P. Widmayer
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.02.001